منابع مشابه
L'esperienza di uno specializzando
Located in the central plateau area of Tanzania in East Africa, St Gaspar’s Hospital was founded in 1968 by the Society of the Precious Blood Catholic Missionaries. Elevated to referral hospital at a regional level, with an approved capacity of 320 beds, it provides residential consultancy services in general medicine, surgery, obstetrics, gynecology and pediatrics for more than 100,000 people....
متن کاملThe complexity of UNO
This paper investigates the popular card game UNOR © from the viewpoint of algorithmic combinatorial game theory. We define simple and concise mathematical models for the game, including both cooperative and uncooperative versions, and analyze their computational complexity. In particular, we prove that even a single-player version of UNO is NP-complete, although some restricted cases are in P....
متن کاملClasificación de frases obscenas o vulgares dentro de tweets
Resumen. Se propone una metodología para la detección frases obscenas y vulgares en los tweets, debido a que México es uno países donde se usa mucho el doble sentido para comunicarse. La metodología propuesta se apoya en un diccionario de mexicanismos etiquetado manualmente por expertos. Se pudo detectar que las palabras obscenas y vulgares son las que más se emplean y los estados del país que ...
متن کاملWhy Grow Slowly in a Dangerous Place? Postnatal Growth, Thermoregulation, and Energetics of Nestling Green-rumped Parrotlets (forpus Passerinus)
Resumen.—Estudiamos el crecimiento en Forpus passerinus, un periquito neotropical pequeño que presenta un período inusualmente largo de presencia de pichones en el nido (– días) y que alimenta a sus pichones con semillas nutricionalmente pobres. Nos preguntamos por qué los pichones crecen tan lentamente a pesar de que la depredación de los nidos es su principal factor de mortalidad. Examina...
متن کاملUNO Gets Easier for a Single Player
This work is a follow up to [2, FUN 2010], which initiated a detailed analysis of the popular game of UNO R ©. We consider the solitaire version of the game, which was shown to be NP-complete. In [2], the authors also demonstrate a n ) algorithm, where c is the number of colors across all the cards, which implies, in particular that the problem is polynomial time when the number of colors is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Investigacion e Innovación en Ingenierias
سال: 2017
ISSN: 2344-8652
DOI: 10.17081/invinno.6.1.2879